منابع مشابه
Normalization in Genetic Algorithms
Normalization is an approach that transforms the genotype of one parent to be consistent with that of the other parent. It is a method for alleviating difficulties caused by redundant encodings in genetic algorithms. We show that normalization plays a role of reducing the search space to another one of less size. We provide insight into normalization through theoretical arguments, performance t...
متن کاملTwo Strategies Based on Meta-Heuristic Algorithms for Parallel Row Ordering Problem (PROP)
Proper arrangement of facility layout is a key issue in management that influences efficiency and the profitability of the manufacturing systems. Parallel Row Ordering Problem (PROP) is a special case of facility layout problem and consists of looking for the best location of n facilities while similar facilities (facilities which has some characteristics in common) should be arranged in a row ...
متن کاملParallel Algorithms for Hierarchical
Hierarchical clustering is a common method used to determine clusters of similar data points in multidimensional spaces. O(n 2) algorithms are known for this problem 3, 4, 10, 18]. This paper reviews important results for sequential algorithms and describes previous work on parallel algorithms for hierarchical clustering. Parallel algorithms to perform hierarchical clustering using several dist...
متن کاملParallel Algorithms for Certain
The complexity of performing matrix computations, such as solving a linear system, inverting a nonsingular matrix or computing its rank, has received a lot of attention by both the theory and the scientiic computing communities. In this paper we address some \nonclassical" matrix problems that nd extensive applications, notably in control theory. More precisely, we study the matrix equations AX...
متن کاملParallel Algorithms for Series Parallel Graphs
In this paper, a parallel algorithm is given that, given a graph G = (V;E), decides whether G is a series parallel graph, and if so, builds a decomposition tree for G of series and parallel composition rules. The algorithm uses O(log jEj log jEj) time and O(jEj) operations on an EREW PRAM, and O(log jEj) time and O(jEj) operations on a CRCW PRAM (note that ifG is a simple series parallel graph,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2013
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2012.07.002